Co-Occurring Directions Sketching for Approximate Matrix Multiply
نویسندگان
چکیده
We introduce co-occurring directions sketching, a deterministic algorithm for approximate matrix product (AMM), in the streaming model. We show that co-occurring directions achieves a better error bound for AMM than other randomized and deterministic approaches for AMM. Co-occurring directions gives a (1 + ")-approximation of the optimal low rank approximation of a matrix product. Empirically our algorithm outperforms competing methods for AMM, for a small sketch size. We validate empirically our theoretical findings and algorithms.
منابع مشابه
Co-Occuring Directions Sketching for Approximate Matrix Multiply
We introduce co-occurring directions sketching, a deterministic algorithm for approximate matrix product (AMM), in the streaming model. We show that co-occuring directions achieves a better error bound for AMM than other randomized and deterministic approaches for AMM. Co-occurring directions gives a (1 + ε)-approximation of the optimal low rank approximation of a matrix product. Empirically ou...
متن کاملFaster Anomaly Detection via Matrix Sketching
We present efficient streaming algorithms to compute two commonly used anomaly measures: the rank-k leverage scores (aka Mahalanobis distance) and the rank-k projection distance, in the rowstreaming model. We show that commonly used matrix sketching techniques such as the Frequent Directions sketch and random projections can be used to approximate these measures. Our main technical contribution...
متن کاملOn Sketching Matrix Norms and the Top Singular Vector
Sketching is a prominent algorithmic tool for processinglarge data. In this paper, we study the problem of sketchingmatrix norms. We consider two sketching models. The firstis bilinear sketching, in which there is a distribution overpairs of r×n matrices S and n× s matrices T such that forany fixed n×n matrix A, from S ·A ·T one can approximate‖A‖p up to an approxima...
متن کاملFrequent Directions for Matrix Sketching with Provable Bounds: A Generalized Approach
ABSTRACT We consider the task of matrix sketching, which is obtaining a significantly smaller representation of matrix A while retaining most of its information (or in other words, approximates A well). In particular, we investigate a recent approach called Frequent Directions (FD) initially proposed by Liberty [5] in 2013, which has drawn wide attention due to its elegancy, nice theoretical gu...
متن کاملFrequent Direction Algorithms for Approximate Matrix Multiplication with Applications in CCA
Approximate matrix multiplication (AMM) becomes increasingly popular because it makes matrix computation suitable for large-scale datasets. Most previous AMM methods are based on the idea of random selection or random projection. In this paper, we propose a deterministic algorithm FD-AMM for computing an approximation to the product of two given matrices. Moreover, the algorithm works in a stre...
متن کامل